Relations between adjacency trees
نویسندگان
چکیده
منابع مشابه
Relations between adjacency trees
Adjacency trees can model the nesting structure of spatial regions. In many applications it is necessary to model foreground and background regions which exhibit changes over time such as splitting, where one region divides into two. For example, the qualitative description of the development of wildfires would use the foreground for areas on fire and the background for areas not on fire. Such ...
متن کاملComputing Topological Adjacency Relations Between Iso-contour s
Contoured charts are widely used to visualize 2D physical fields . Experts can identify global patterns and structures in a contoured chart by looking at the isocurves and reasoning about their spatial relations . We develop an algorithm for computing the topological adjacency relations between iso-contours . The algorithm is novel in that it grounds the computation of spatia l relations betwee...
متن کاملOn some relations between 2-trees and tree metrics
A tree function (TF) t on a nite set X is a real function on the set of the pairs of elements of X satisfying the four-point condition: for all distinct x; y; z; w∈X; t(xy)+ t(zw)6max{t(xz)+ t(yw); t(xw) + t(yz)}. Equivalently, t is representable by the lengths of the paths between the leaves of a valued tree Tl. TFs are a straightforward generalization of the tree dissimilarities and tree metr...
متن کاملComputation of Transition Adjacency Relations Based on Complete Prefix Unfolding
An increasing number of works have devoted to the application of Transition Adjacency Relation (TAR) as a means to capture behavioral features of business process models. In this paper, we systematically study the efficient TAR derivation from process models using unfolding technique which previously has been used to address the state space explosion when dealing with concurrent behaviors of a ...
متن کاملSense Disambiguation using Semantic Relations and Adjacency Information
This paper describes a heuristic-based approach to word-sense disambiguation. The heuristics that are applied to disambiguate a word depend on its part of speech, and on its relationship to neighboring salient words in the text. Parts of speech are found through a tagger, and related neighboring words are identified by a phrase extractor operating on the tagged text. To suggest possible senses,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.04.029